Refine your search
Collections
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Selvadoss Thanamani, Antony
- Clustering of Navigation Patterns using Bolzwano_Weierstrass Theorem
Abstract Views :214 |
PDF Views:0
Authors
Affiliations
1 CMS College of Science & Commerce (Autonomous), Coimbatore, Tamilnadu, IN
2 Computer Science, NGM College (Autonomous), Pollachi, Coimbatore, Tamilnadu, IN
1 CMS College of Science & Commerce (Autonomous), Coimbatore, Tamilnadu, IN
2 Computer Science, NGM College (Autonomous), Pollachi, Coimbatore, Tamilnadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 12 (2015), Pagination:Abstract
Objectives: The primary objective of this research paper is to design a new and efficient clustering technique to group user navigation patterns which are useful for classification system to classify a new user with the previous users group. Methodology: Three real time web log data sets are collected from e-commerce web server, academic institution web server and a research journal web server. All three sets were collected from IIS web servers. After navigation patterns are derived from preprocessing step it is clustered into groups by using traditional Fuzzy C-Means technique. The clusters are validated and re-clustered using Bolzano_Weierstrass Theorem. Findings: Web log data is preprocessed and ICA is applied in the user session matrix to select relevant and important features. To measure the clustering accuracy of proposed and the existing methods, the parameters such as Rand Index, F measure are calculated and compared. It shows proposed BWFCM have higher rand index rate than FCM and lesser error rate. To understand the impact of the feature selection method, the data sets were implemented with the existing and proposed methods of feature selection. The parameters taken for comparison were Rand Index, Sum of Squared Errors, F-measure. The method was implemented in all the three data sets after data cleaning, session construction step. Clustering was carried out twice with the proposed clustering algorithm in all the three data sets, without selecting features and after selecting features. It was observed that the clustering results are poor when applied in full data set with irrelevant features, and the performance was increased after relevant features were selected. Conclusion: The result of the optimized clustering proves its significance and there is an increase in similarity of intra clustering and dissimilarity in inter clustering than the existing methods.Keywords
Bolzano_Weierstrass Theorem, Clustering, Feature Selection, Navigation Patterns, Web Usage Mining- Reactive Congestion Control Active Queue Management Schemes-Survey
Abstract Views :164 |
PDF Views:3
Authors
Affiliations
1 Dept of Comp. Sci, SNR Sons College, Coimbatore, IN
2 NGM College, Pollachi, IN
1 Dept of Comp. Sci, SNR Sons College, Coimbatore, IN
2 NGM College, Pollachi, IN
Source
Networking and Communication Engineering, Vol 1, No 1 (2009), Pagination: 24-27Abstract
Internet the growing technology with the emergence of new applications and diverse quality of service requirements has become increasingly important. Congestion the major problem in internet requires some management in responsive and unresponsive flows. Active Queue Management (AQM) schemes are a class of queue management algorithms which are designed to overcome the drawbacks in the classical drop-tail queues and for congestion avoidance and congestion prevention. These AQM schemes are classified based on the decisions taken while dropping the packets. The types of marking or dropping the packets to improve the throughput , performance , fairness in bursty traffics and the packet loss ratio are involved. The reactive congestion control active queue management schemes are discussed in this paper.Keywords
Congestion Control, AQM, RED, Queue Management.- Survey on Data Replication in Grid Environment
Abstract Views :155 |
PDF Views:3
Authors
Affiliations
1 Dept. of Comp Science, S.N.R Sons College, Coimbatore, IN
2 NGM College, Pollachi, IS
1 Dept. of Comp Science, S.N.R Sons College, Coimbatore, IN
2 NGM College, Pollachi, IS
Source
Networking and Communication Engineering, Vol 1, No 1 (2009), Pagination: 28-31Abstract
Data Grid deals with data intensive applications in scientific and enterprise computing. These applications handle large data sets that need to be transferred and replicated among different grid sites. Data replication is an important technique for data availability and data access. Data should be replicated in an automatic way to make the system more reliable, accessible and less sensitive to subsystem failures. Replication allows faster access to files and increases the job execution performance. This paper provides a survey on various replication algorithms, some of its merits and demerits.Keywords
Grid Computing, Data Application, Data Grid, Data Replication.- ESWCA:An Efficient Algorithm for Mining Frequent Itemsets
Abstract Views :213 |
PDF Views:1
Authors
Affiliations
1 Department of Computer Science, NGM College, Pollachi, IN
1 Department of Computer Science, NGM College, Pollachi, IN
Source
Data Mining and Knowledge Engineering, Vol 3, No 5 (2011), Pagination: 300-306Abstract
The most significant tasks in data mining are the process of mining frequent itemsets over data streams. It should support the flexible trade-off between processing time and mining accuracy. The objective was to propose an effective algorithm which generates frequent itemsets in a very less time by avoiding multiple scans. In this paper, we present an improved algorithm ESWCA for mining frequent itemsets using sliding window model. The ESWCA algorithm processes on an on-line transactional data stream. In this approach, we handle continues transaction slides in a segment-based manner which produces the improved runtime and memory consumption. Also, by revising the fair-cutter in the novel algorithm, multiple scans of the entire datasets will be avoided. Our experiments show that our algorithm not only achieved effectively consumes less memory, but also runs in an efficient manner.Keywords
Data Stream, Data-Stream Mining, Frequent Itemset, and Sliding Window.- A Novel Association Rule Mining Algorithm to Enhance Confidentiality in Data Mining
Abstract Views :224 |
PDF Views:3
Authors
Affiliations
1 Department of Computer Applications, J.J. College of Arts and Science, Pudukkottai, Tamilnadu, IN
2 Department of Computer Science, NGM College, Pollachi, Coimbatore, Tamilnadu, IN
1 Department of Computer Applications, J.J. College of Arts and Science, Pudukkottai, Tamilnadu, IN
2 Department of Computer Science, NGM College, Pollachi, Coimbatore, Tamilnadu, IN
Source
Data Mining and Knowledge Engineering, Vol 3, No 5 (2011), Pagination: 307-313Abstract
Data mining is the process of extracting hidden patterns from data. As more data is gathered, with the amount of data increasing every year, data mining is becoming an increasingly important tool to transform this data into information. We focus on APRIORI algorithm, a popular data mining technique and analyze the performance of linked list based implementation as a basis for mining frequent item sequences in a transactional database. This algorithm has given us new capabilities to identify associations in large data sets. But an important issue, still not sufficiently scanned, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. We work with some association rule hiding algorithms and examine their performances in order to analyze their time complexity and the impact that they have in the original database. We work a side effect – the number of new rules generated during the hiding process.Keywords
Association Rule Mining, Apriori Algorithm, Privacy Issues, Hiding Strategies.- Knowledge Management System Architecture for Industrial Applications Using Web Mining Techniques
Abstract Views :181 |
PDF Views:3
Authors
Affiliations
1 Department of Computer Science, Yadava College, Madurai, IN
2 Department of Computer Science, NGM College, Coimbatore, IN
1 Department of Computer Science, Yadava College, Madurai, IN
2 Department of Computer Science, NGM College, Coimbatore, IN